Quantitative Temporal Logic
نویسندگان
چکیده
We deene a quantitative Temporal Logic that is based on a simple modality within the framework of Monadic Predicate Logic. Its canonical model is the real line (and not an !-sequence of some type). We prove its decidability using general theorems from Logic (and not Automata theory). We show that it is as expressive as any alternative suggested in the literature.
منابع مشابه
Parametric Quantitative Temporal Reasoning
We deene Parameterized Real-Time Computation Tree Logic (PRTCTL), which allows quantitative temporal speciications to be parameterized over the natural numbers. Parameterized quantitative speciications are quantitative speciications in which concrete timing information has been abstracted away. Such abstraction allows designers to specify quantitative restrictions on the temporal ordering of ev...
متن کاملAlmost-certain eventualities and abstract probabilities in quantitative temporal logic
‘Almost-certain eventualities’ are liveness properties that hold with probability 1. ‘Abstract probabilities’ are probabilities in transition systems about which we know only that they are neither 0 nor 1. Vardi [16] showed that almost-certain properties in linear temporal logic depend only on abstract probabilities, rather than on the probabilities’ precise values; we discuss the extent to whi...
متن کاملTimed Automata Approach to Verification of Systems with Degradation
We focus on systems that naturally incorporate a degrading quality, such as electronic devices with degrading electric charge or broadcasting networks with decreasing power or quality of a transmitted signal. For such systems, we introduce an extension of linear temporal logic with quantitative constraints (Linear Temporal Logic with Degradation Constraints, or DLTL for short) that provides a u...
متن کاملA Quantitative Characterization of Weighted Kripke Structures in Temporal Logic
We extend the usual notion of Kripke Structures with a weighted transition relation, and generalize the usual Boolean satisfaction relation of CTL to a map which assigns to states and temporal formulae a real-valued distance describing the degree of satisfaction. We describe a general approach to obtaining quantitative interpretations for a generic extension of the CTL syntax, and show that, fo...
متن کاملAlmost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL
‘Almost-certain eventualities’ are liveness properties that hold with probability 1. ‘Abstract probabilities’ in transition systems are those known only to be bounded away from zero and from one. Vardi [1] showed that almost-certain properties in linear temporal logic depend only on abstract probabilities, rather than on the probabilities’ precise values. We discuss the extent to which a simila...
متن کامل